The Transitive Graphs with at Most 26 Vertices
نویسندگان
چکیده
We complete the construction of all the simple graphs with at most 26 vertices and transitive automorphism group. The transitive graphs with up to 19 vertices were earlier constructed by McKay, and the transitive graphs with 24 vertices by Praeger and Royle. Although most of the construction was done by computer, a substantial preparation was necessary. Some of this theory may be on independent interest.
منابع مشابه
COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملCubic vertex-transitive graphs on up to 1280 vertices
A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arcset, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertex-transitive graphs of order at most 1280. ...
متن کاملMost Regular Graphs Are Quickly R-transitive
Consider a d-regular directed graph, G, on n vertices determined by d permutations 1; : : : ; d 2 Sn. Each word, w, over the alphabet = f 1; 2; : : : ; dg determines a walk at each vertex, and these walks give rise to a permutation of the vertices (which is simply the product of the permutations). Such a word maps a distinct r-tuple of vertices, (v1; : : : ; vr) to another distinct r-tuple of v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990